Integrating Testing and Interactive Theorem Proving
نویسندگان
چکیده
منابع مشابه
Integrating Testing and Interactive Theorem Proving
Using an interactive theorem prover to reason about programs involves a sequence of interactions where the user challenges the theorem prover with conjectures. Invariably, many of the conjectures posed are in fact false, and users often spend considerable effort examining the theorem prover’s output before realizing this. We present a synergistic integration of testing with theorem proving, imp...
متن کاملIntegrating Automated and Interactive Theorem Proving
This paper highlights a project to integrate interactive and automated theorem proving in Software Veriication. Its aim is to combine the advantages of the two paradigms. We report on the integration concepts, and on the experimental results with a prototype implementation .
متن کاملIntegrating Automated and Interactive Theorem Proving in Type Theory
We introduce an approach of integrating automated theorem proving techniques into the interactive theorem prover Agda. Our approach is generic and flexible, and can be combined with dependently typed programming. We have implemented the special cases of SAT solving and CTL model checking. The tool has been used for verifying the correctness of railway interlocking systems.
متن کاملJProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
R. Gore, A. Leitsch, T. Nipkow, eds. International Joint Conference on Automated Reasoning (IJCAR 2001), LNAI 2083, pp. 421–426, c ©Springer Verlag, 2001. Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. This paper gives a brief overview o...
متن کاملInteractive Theorem Proving with Tasks
Interactive theorem proving systems for mathematics require user interfaces which allow for user interaction that is as natural as possible. However, this interaction is often limited by the traditional calculi underlying most theorem proving systems. This is particularly problematic with respect to the application of assertions and intuitive presentation of proof states. In this paper we show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.70.1